Robust Line Matching Based on Ray-Point-Ray Structure Descriptor
نویسندگان
چکیده
Abstract. In this paper, we propose a novel two-view line matching method through converting matching line segments extracted from two uncalibrated images to matching the introduced Ray-Point-Ray (RPR) structures. The method first recovers the partial connectivity of line segments through sufficiently exploiting the gradient map. To efficiently matching line segments, we introduce the Ray-Point-Ray (RPR) structure consisting of a joint point and two rays (line segments) connected to the point. Two sets of RPRs are constructed from the connected line segments extracted from two images. These RPRs are then described with the proposed SIFT-like descriptor for efficient initial matching to recover the fundamental matrix. Based on initial RPR matches and the recovered fundamental matrix, we propose a match propagation scheme consisting of two stages to refine and find more RPR matches. The first stage is to propagate matches among those initially formed RPRs, while the second stage is to propagate matches among newly formed RPRs constructed by intersecting unmatched line segments with those matched ones. In both stages, candidate matches are evaluated by comprehensively considering their descriptors, the epipolar line constraint, and the topological consistency with neighbor point matches. Experimental results demonstrate the good performance of the proposed method as well as its superiority to the state-of-the-art methods.
منابع مشابه
Descriptor-Free Smooth Feature-Point Matching for Images Separated by Small/Mid Baselines
Most existing feature-point matching algorithms rely on photometric region descriptors to distinct and match feature points in two images. In this paper, we propose an efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images separated by small or mid camera baselines. The proposed algorithm does not rely on photometric descriptors for matching...
متن کاملThink locally, fit globally: Robust and fast 3D shape matching via adaptive algebraic fitting
In this paper, we propose a novel 3D free form surface matching method based on a novel key-point detector and a novel feature descriptor. The proposed detector is based on algebraic surface fitting. By global smooth fitting, our detector achieved high computational efficiency and robustness against nonrigid deformations. For the feature descriptor, we provide algorithms to compute 3D critical ...
متن کاملThing Locally, Fit Globally: Robust and Fast 3D Shape Matching via Adaptive Algebraic Fitting
In this paper, we propose a novel 3D free form surface matching method based on a novel key-point detector and a novel feature descriptor. The proposed detector is based on algebraic surface fitting. By global smooth fitting, our detector achieved high computational efficiency and robustness against non-rigid deformations. For the feature descriptor, we provide algorithms to compute 3D critical...
متن کاملRobust 2D Shape Correspondence using Geodesic Shape Context
A meaningful correspondence and similarity measure between shapes is particularly useful in applications such as morphing, object recognition, shape registration and retrieval. In this paper, we present a robust shape descriptor for points along a 2D contour, based on the curvature distribution collected over bins arranged geodesically along the contour. Convolution, binning and hysteresis thre...
متن کاملA Segmentation Descriptor for Recognition
We present a segmentation-based image descriptor and similarity measure and apply them for object recognition. A segmentation gives a middle-level image representation which is robust to the intensity and structure variations that cause problems for matching based on low-level descriptors. A segmentation descriptor can give more accurate and efficient matching of boundaries than methods based o...
متن کامل